Introduction of Operating System – Set 1
An operating system acts as an intermediary between the user of a computer and computer hardware. The purpose of an operating system is to provide an environment in which a user can execute programs conveniently and efficiently....
read more
‘crontab’ in Linux with Examples
The crontab is a list of commands that you want to run on a regular schedule, and also the name of the command used to manage that list. Crontab stands for “cron table, ” because it uses the job scheduler cron to execute tasks; cron itself is named after “chronos, ” the Greek word for time. cron is the system process which will automatically perform tasks for you according to a set schedule. The schedule is called the crontab, which is also the name of the program used to edit that schedule....
read more
Program for Round Robin Scheduling for the same Arrival time
Round Robin is a CPU scheduling algorithm where each process is cyclically assigned a fixed time slot. It is the preemptive version of the First come First Serve CPU Scheduling algorithm....
read more
Program for Shortest Job First (or SJF) CPU Scheduling | Set 1 (Non- preemptive)
The shortest job first (SJF) or shortest job next, is a scheduling policy that selects the waiting process with the smallest execution time to execute next. SJN, also known as Shortest Job Next (SJN), can be preemptive or non-preemptive....
read more
Program for FCFS CPU Scheduling | Set 1
Given n processes with their burst times, the task is to find average waiting time and average turn around time using FCFS scheduling algorithm. First in, first out (FIFO), also known as first come, first served (FCFS), is the simplest scheduling algorithm. FIFO simply queues processes in the order that they arrive in the ready queue. In this, the process that comes first will be executed first and next process starts only after the previous gets fully executed. Here we are considering that arrival time for all processes is 0....
read more
Paging in Operating System
Paging is a memory management scheme that eliminates the need for a contiguous allocation of physical memory. The process of retrieving processes in the form of pages from the secondary storage into the main memory is known as paging. The basic purpose of paging is to separate each procedure into pages. Additionally, frames will be used to split the main memory. This scheme permits the physical address space of a process to be non – contiguous....
read more
Disk Scheduling Algorithms
Disk scheduling is done by operating systems to schedule I/O requests arriving for the disk. Disk scheduling is also known as I/O Scheduling....
read more
ARM Interview Experience for Intern (On-Campus Virtual 2020)
ARM talent acquisition team visited our campus virtually for an intern role in the verification domain. There were totally 3 rounds,...
read more
Difference between Android 1.0 and Android 3.2.2
1. Android 1.0 : Android 1.0 is the very first version of Android which was introduced by Google. It had some basic features including web browser support, camera support, Gmail accounts, Google maps and Youtube application. Although it does not have the official version name like further introduces versions but unofficially it is called Apple Pie. The API level in Android 1.0 version is 1. It is not used anymore in the mobile devices. It was released on 23 September 2008....
read more
Difference between Android 1.0 and Android 4.1
1. Android 1.0 : Android 1.0 is the very first version of Android which was introduced by Google. It had some basic features including web browser support, camera support, Gmail accounts, Google maps and Youtube application. Although it does not have the official version name like further introduces versions but unofficially it is called Apple Pie. The API level in Android 1.0 version is 1. It is not used anymore in the mobile devices. It was released on 23 September 2008....
read more
Cvent Interview Experience (On campus for Internship and Full Time)
...
read more
SCAN – EDF Scheduling in OS
SCAN-EDF is a disk scheduling algorithm that is the same as the EDF algorithm but utilizes the seek optimization technique of the ‘SCAN’ algorithm when similar deadlines occur....
read more